package topcoder.srm467;

public class ShorterSuperSum {

	public int calculate(int k, int n) {
		int[][] sums = new int[k + 1][n + 1];

		for (int j = 0; j <= n; j++)
			sums[0][j] = j;

		for (int i = 1; i <= k; i++) {
			for (int j = 1; j <= n; j++) {
				sums[i][j] = sums[i][j - 1] + sums[i - 1][j];
			}
		}
		return sums[k][n];

	}

	public static void main(String[] args) {
		ShorterSuperSum sss = new ShorterSuperSum();
		System.out.println(sss.calculate(10, 10));

	}

}
